Form Invariance and Implicit Parallelism
نویسندگان
چکیده
منابع مشابه
Form invariance and implicit parallelism.
Holland's schema theorem (an inequality) may be viewed as an attempt to understand genetic search in terms of a coarse graining of the state space. Stephens and Waelbroeck developed that perspective, sharpening the schema theorem to an equality. Of particular interest is a "form invariance" of their equations; the form is unchanged by the degree of coarse graining. This paper establishes a simi...
متن کاملImplicit Parallelism
This paper assumes a search space of fixed-length strings, where the size of the alphabet can vary from position to position. Structural crossover is mask-based crossover, and thus includes n-point and uniform crossover. Structural mutation is mutation that commutes with a group operation on the search space. This paper shows that structural crossover and mutation project naturally onto competi...
متن کاملConditions for Implicit Parallelism
Many interesting varieties of genetic algorithms have been designed and implemented in the last fifteen years. One way to improve our understanding of genetic algorithms is to identify properties that are invariant across these seemingly different versions. This paper focuses on invariants among genetic algorithms that differ along two dimensions: (1) the way user-defined objective function is ...
متن کاملLoad Bounding for Implicit Parallelism
It is well known that exploiting parallelism beyond the available machine parallelism can lead to vastly increased resource requirements. Programs which can run in linear space under a sequential execution regime may require exponential space in the context of unrestricted parallelism. In this paper we present an efficient adaptive software solution for the problem of avoiding excessive paralle...
متن کاملImplicit Parallelism in Genetic Algorithms
This paper is related to Holland's result on implicit parallelism. Roughly speaking, Holland showed a lower bound of the order of n c1 l to the number of schemata usefully processed by the genetic algorithm in a population of n = c1 ⋅2 l binary strings, with c1 a small integer. We analyze the case of population of n = 2βl binary strings where β is a positive parameter (Holland's result is relat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Evolutionary Computation
سال: 2001
ISSN: 1063-6560,1530-9304
DOI: 10.1162/106365601750406037